简体版 繁體版 English 한국어
登録 ログイン

program fragmentの例文

例文モバイル版携帯版

  • Pseudo-code for the two program fragments is shown below.
  • For example, consider the Pascal program fragment at right.
  • The following C program fragment has an essential complexity of four; its CFG is irreducible.
  • :You only copied a program fragment.
  • The following program fragment defines a higher-order function startAt with a parameter x and a nested function incrementBy.
  • He then produced a set of program fragments which were more like real code and which collectively matched the original 124 Whetstone instructions.
  • The program fragment depends on a global variable, " sym ", which contains the current symbol from the input, and the function " nextsym ", which updates " sym " when called.
  • Of course, there's a downside to all this : Until we get faster than 28-or 33-Kbps Internet connections, these download program fragments will remain small and relatively annoying rather than become truly immersive.
  • For example, the following C program fragment has an essential complexity of 1, because the inner "'if "'statement and the "'for "'can be reduced, i . e . it is a structured program.
  • It is related to the idea of genetic programming in that the objective is to find an executable program or program fragment, that will achieve a good fitness value for the given objective function.
  • For example, consider a program fragment containing three statement groups inside a loop : ( SCC1 + SCC2 ), SCC3 and SCC4, in that order, in which only the second group ( SCC3 ) can be vectorized.